Nuprl Lemma : is-sys-valid 11,40

es:ES, Config:AbsInterface(chain_config()), Cmd:Type, Sys:AbsInterface(chain_sys(Cmd)), e:E.
((e  Sys(valid)))  (((e  Sys)) & valid-sys(es;Config;Sys;e)) 
latex


Definitionss = t, t  T, x:AB(x), x:AB(x), EState(T), a:A fp B(a), f(a), Id, , strong-subtype(A;B), P  Q, Type, EqDecider(T), Unit, left + right, IdLnk, x:A  B(x), EOrderAxioms(Epred?info), kindcase(ka.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), type List, , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r  s, e < e', , b, constant_function(f;A;B), SWellFounded(R(x;y)), , pred!(e;e'), x,yt(x;y), <ab>, A, pred(e), first(e), xt(x), P & Q, Top, ES, AbsInterface(A), chain_config(), let x,y = A in B(x;y), chain_sys(Cmd), P  Q, E, {x:AB(x)} , E(X), t.1, case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , e  X, valid-sys(es;Config;Sys;e), (e <loc e'), inr x , "$token", X(e), ccpred?(x), inl x , Atom, x.A(x), e<e'P(e), ccpred-id(x), e<e'.P(e), ccsucc?(x), cctail?(x), P  Q, cchead?(x), ff, tt, True, A c B, chain_sys_ind(x;cmd.input(cmd);from,cmds.update(from;cmds)), P  Q, (x  l), x  dom(f), loc(e), valid-sys-dcdr{i:l}(es;Config;Cmd;Sys), (I|p), Sys(valid)
Lemmasiff functionality wrt iff, es-is-interface-restrict, valid-sys-dcdr wf, es-interface-restrict wf, pi1 wf, es-loc wf, es-is-interface wf, iff wf, rev implies wf, true wf, btrue wf, bfalse wf, cchead? wf, cctail? wf, ccsucc? wf, existse-before wf, ccpred-id wf, alle-lt wf, es-locl wf, ccpred? wf, es-interface-val wf2, valid-sys wf, es-E-interface wf, chain config wf, chain sys wf, es-interface wf, es-E wf, event system wf, deq wf, EOrderAxioms wf, IdLnk wf, Msg wf, unit wf, nat wf, val-axiom wf, qle wf, cless wf, bool wf, top wf, Knd wf, kindcase wf, constant function wf, assert wf, not wf, loc wf, pred! wf, strongwellfounded wf, member wf, rationals wf, Id wf, EState wf, subtype rel wf

origin